The Incomputable Alan Turing
نویسنده
چکیده
The last century saw dramatic challenges to the Laplacian predictability which had underpinned scientific research for around 300 years. Basic to this was Alan Turing’s 1936 discovery (along with Alonzo Church) of the existence of unsolvable problems. This paper focuses on incomputability as a powerful theme in Turing’s work and personal life, and examines its role in his evolving concept of machine intelligence. It also traces some of the ways in which important new developments are anticipated by Turing’s ideas in logic.
منابع مشابه
Turing Incomputable Computation
A new computing model, called the active element machine (AEM), is presented that demonstrates Turing incomputable computation using quantum random input. The AEM deterministically executes a universal Turing machine (UTM) program η with random active element firing patterns. These firing patterns are Turing incomputable when the AEM executes a UTM having an unbounded number of computable steps...
متن کاملComputing a Turing-Incomputable Problem from Quantum Computing
A hypercomputation model named Infinite Square Well Hypercomputation Model (ISWHM) is built from quantum computation. This model is inspired by the model proposed by Tien D. Kieu [1] and solves an Turing-incomputable problem. For the proposed model and problem, a simulation of its behavior is made. Furthermore, it is demonstrated that ISWHM is a universal quantum computation model.
متن کاملCalculus of Cost Functions
We study algebraic properties of cost functions. We give an application: building sets close to being Turing complete.
متن کاملA measure-theoretic proof of Turing incomparability
We prove that if S is an ω-model of weak weak König’s lemma and A ∈ S, A ⊆ ω, is incomputable, then there exists B ∈ S, B ⊆ ω, such that A and B are Turing incomparable. This extends a recent result of Kučera and Slaman who proved that if S0 is a Scott set (i.e. an ω-model of weak König’s lemma) and A ∈ S0, A ⊆ ω, is incomputable, then there exists B ∈ S0, B ⊆ ω, such that A and B are Turing in...
متن کاملThe complexity of proving chaoticity and the Church-Turing thesis.
Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, classical physical systems may "compute the hard or even the incomputable" by measuring observables which correspond to computationally hard or even incomputable problems.
متن کامل